منابع مشابه
Complexity Ranks of Countable Models
We define some variations of the Scott rank for countable models and obtain some inequalities involving the ranks. For mono-unary algebras we prove that the game rank of any subtree does not exceed the game rank of the whole model. However, similar questions about linear orders remain unresolved.
متن کاملCantor-Bendixson ranks of countable SFTs
We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form λ + 3, where λ is a computable ordinal. This result was claimed by the author in his PhD dissertation, but the proof contains an error, which is fixed in this note.
متن کاملRelative Ranks of Lipschitz Mappings on Countable Discrete Metric Spaces
Let X be a countable discrete metric space and let XX denote the family of all functions on X. In this article, we consider the problem of finding the least cardinality of a subset A of XX such that every element of XX is a finite composition of elements of A and Lipschitz functions on X. It follows from a classical theorem of Sierpiński that such an A either has size at most 2 or is uncountabl...
متن کاملOn the complexity of Boolean matrix ranks
We construct a reduction which proves that the fooling set number and the determinantal rank of a Boolean matrix are NP-hard to compute. This note is devoted to the functions of determinantal rank and fooling set number, which are receiving attention in different applications, see [1, 3] and references therein. The purpose of this note is to give an NP-completeness proof for those functions, th...
متن کاملComplexity of Countable Categoricity in Finite Languages
We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages. S.Lempp and T.Slaman proved in [7] that indexes of decidable ω-categorical theories form a Π3-subset of the set of indexes of all computably enumerable theories. Moreover there is an infinite language so that the property of ω-categoricity distinguishes a Π3-complete subset of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2007
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1172787543